Parallel Simulation of Tasks Scheduling and Scheduling Criteria in High-performance Computing Systems
نویسندگان
چکیده
منابع مشابه
FLAW: FaiLure-Aware Workflow Scheduling in High Performance Computing Systems
The goal of workflow application scheduling is to achieve minimal makespan for each workflow. Scheduling workflow applications in high performance computing environments, e.g., clusters, is an NP-Complete problem, and becomes more complicated when potential resource failures are considered. While more research on failure prediction has been witnessed in recent years to improve system availabili...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملScheduling Preemptive Tasks in Parallel and Distributed Systems
Algorithms for the scheduling of tasks within a parallel program onto available processors generally assume that communication only occurs at the start or end of each task, i.e., a task can only commence execution when all necessary data has been sent to it. This is termed \non-preemptive task scheduling". This paper examines the problem of the preemptive parallel program which is represented b...
متن کاملTask Scheduling Algorithm for High Performance Heterogeneous Distributed Computing Systems
The main objective of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. Several algorithms have been proposed for solving task-scheduling problem. The most of them doesn't take into account the average communication of parents and data ready time. In this paper, a new static scheduling...
متن کاملScheduling Parallel Tasks Approximation Algorithms
Scheduling is a crucial problem in parallel and distributed processing. It consists in determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms has to be reconsidered by the influence of new execution supports (namely, clusters of workstations, grid computing and global computing) which are characterized by a larger number of heterogeneous pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of information and organizational sciences
سال: 2019
ISSN: 1846-9418,1846-3312
DOI: 10.31341/jios.43.2.5